R－X图解法计算多级串联理想混合反应器

论述Ｒ－Ｘ图解法计算多级串联理想混合反应器的基本原理，并结合实例，对Ｒ－Ｘ法的计算步骤予以详细介绍，为多级串联反应器的设计与计算，提供一种新颖适用的图解计算方法。     

Fast Recognition of Fibonacci Cubes

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time. A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297.     

On the Fundamental Limits of Topology Control in Ad Hoc Networks

We prove two results that provide new fundamental limits for topology control in large ad hoc and sensor networks. First, we show that it remains true under very general conditions that the maximum expected node degree must grow to infinity at least logarithmically if we want to maintain asymptotic connectivity. This has been known so far only for much more special models than ours. Building on this result, we prove a new fundamental limit regarding link dynamics, which means the worst case length ratio of the longest and shortest link adjacent to the same node. We prove that if link dynamics remains bounded, then no topology control algorithm can keep a large network connected with high probability. Moreover, bounded link dynamics prevents connectivity in the limit without any a priori assumption on node degrees or transmission ranges. Our results hold in a model that is much more general than the frequently used assumption of uniformly distributed nodes in a regularly shaped planar domain. Our more abstract setting also aims at finding (hopefully) more robust and elegant proofs that have less dependence on the special geometry. Since link dynamics is expected to be bounded in practice, the results strenghten the theoretical basis for the argument that a very large ad hoc or sensor network is unable to maintain connectivity if it has a flat, random organization without additional structure. Supported in part by NSF Grants ANI-0220001 and CCF-0634848.     

Longest fault-free paths in hypercubes with vertex faults

The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f ? n − 2, the n-cube contains a fault-free path with length at least 2ⁿ − 2f − 1 (or 2ⁿ − 2f − 2) between two arbitrary vertices of odd (or even) distance. Since an n-cube is a bipartite graph with two partite sets of equal size, the path is longest in the worst-case. Furthermore, since the connectivity of an n-cube is n, the n-cube cannot tolerate n − 1 faulty vertices. Hence, our result is optimal.     

广义AND／OR图的自底向上的启发式搜索算法BHAO

本文首先根据三角模概念，定义了一类新的更具普遍意义的广义ＡＮＤ／ＯＲ图．根据新定义的启发式函数ｈ（ｎ，ｘ）以及广义ＡＮＤ／ＯＲ图的最佳解树之所有子树亦是最佳子解树的原理，提出了广义ＡＮＤ／ＯＲ图的自底向上的启发式搜索算法ＢＨＡＯ．文中证明了算法ＢＨＡＯ的可采纳性．本文还提出了两类新的启发式函数的单调限制概念，并据此研究了算法ＢＨＡＯ的单调限制性质，研究了两个ＢＨＡＯ算法间的比较性质．     

VB与VC优化配合在安全监察软件系统中的应用

安全监察是矿山安全中很重要的环节。利用VC的强大计算功能和VB的编程简单性采用VB与VC优化配合使用的方法开发安全监察软件系统是快速、简单、高效的设计方法。文章对系统的整体结构和信息流程作了简要的介绍，并对系统的每个部分各以一个例子进行简单的阐述。     

人参皂苷Rg分子轨道微扰理论的研究

人参皂苷Rg是具有生理活性的物质，它包括三个异构体：Rg1；Rg2；Rg3其中R83具有很强的抗癌作用。本文通过休克尔分子图形理论对Rg异构体的各分子轨道进行约化，并且根据分子轨道微扰理论求出它们不同本征多项式和本征值。     

SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS

The purpose of this paper is to examine the impact of scheduling parallel tasks onto non-uniform memory access (NUMA) shared-memory multiprocessor systems by considering non-negligible intertask communications and communication contentions. Communication contentions arise from the communication medium having insufficient capacity to serve all transmissions, thereby causing significant contention delays. Therefore, a new scheduling algorithm, herein referred to as the Extended Critical Path (ECP) algorithm is proposed. The proposed algorithm schedules parallel tasks by considering non-negligible intertask communications and the contentions among shared communication resources. Moreover, it ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results demonstrate the superiority of the ECP algorithm over the scheduling algorithms presented in previous literature.     

PERFORMANCE ANALYSIS OF TASK CLUSTERING HEURISTICS FOR SCHEDULING STATIC DAGS ON MULTIPROCESSOR SYSTEM*

CASS is a task management system that provides facilities for automatic grain-size optimization and task scheduling of parallel programs on distributed memory parallel architectures. The heart of CASS is a clustering module that partitions the tasks of a program into clusters that match the granularity of the target machine. This paper describes the clustering algorithms used by CASS and compares them with the best known algorithms reported in the literature, namely the PY algorithm (for clustering with task duplication) and the DSC algorithm (for clustering with no task duplication). It is shown that the clustering algorithms used by CASS outperform both the PY and DSC algorithms in terms of both speed and solution quality.     

COMPUTING MAXIMUM CLIQUES OF CIRCULAR ARCS IN PARALLEL*

Given a set S of n proper circular arcs, it is required to identify a largest cardinality subset K[S] of S each two of whose members intersect. This paper describes an optimal parallel algorithm to compute K[S]. The algorithm is not based on any previously known sequential solution, and is designed for the CREW PRAM model of computation. It uses 0(n/logn) processors and runs in O(logn) time. An interesting feature of the algorithm is that it transforms the computational geometric problem at hand, to a problem involving computations on 0-1 matrices, and then transforms the latter back into a ray shooting problem in computational geometry.